866. Prime Palindrome - LeetCode Solution

from math import sqrt

class Solution:
    def primePalindrome(self, N: int) -> int:
        flag = 0
        
        if(N==2 or N==1):
            return 2
        
        if(N==3):
            return 3



        def check(N):
            if(str(N)[::-1] == str(N)):
                return True
            else:
                return False


        while(True):

            if(check(N)):
                for j in range(2, int(sqrt(N)) + 1, 1):
                    if (N % j == 0):
                        flag = 0
                        break
                    else:
                        flag = 1

                if(flag ==1):
                    return N
                    break
                    
            if 10**7 < N < 10**8:
                return 100030001

            N+=1